منابع مشابه
Typically-Correct Derandomization for Small Time and Space
Suppose a language L can be decided by a bounded-error randomized algorithm that runs in space S and time n · poly(S). We give a randomized algorithm for L that still runs in space O(S) and time n · poly(S) that uses only O(S) random bits; our algorithm has a low failure probability on all but a negligible fraction of inputs of each length. An immediate corollary is a deterministic algorithm fo...
متن کاملDerandomization That Is Rarely Wrong from Short Advice That Is Typically Good
For every > 0, we present a deterministic log-space algorithm that correctly decides undi-rected graph connectivity on all but at most 2 n of the n-vertex graphs. The same holds for every problem in Symmetric Log-space (i.e., SL). Making no assumptions (and in particular not assuming the ERH), we present a deterministic polynomial-time algorithm that correctly decides primality on all but at mo...
متن کاملPairwise Independence and Derandomization Pairwise Independence and Derandomization
This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a...
متن کاملResource Tradeoffs and Derandomization
We consider uniform assumptions for derandomization. We provide intuitive evidence that BPP can be simulated non-trivially in deterministic time by showing that (1) There is a simulation of P in POLY LOGSPACE that is successful against all polynomial-time adversaries infinitely often, or BPP ⊆ SUBEXP (2) There is a simulation of P in SUBPSPACE that is successful against all polynomialtime adver...
متن کامل44 Randomization and Derandomization
FRAMEWORK AND ANALYSIS Most randomized incremental algorithms in the literature follow the framework sketched here for the computation of the trapezoidal map: the structure to be computed is maintained while the objects defining it are inserted in random order. To insert a new object, one first has to find a “conflict” of that object (the location step), then local updates in the structure are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGACT News
سال: 2010
ISSN: 0163-5700
DOI: 10.1145/1814370.1814389